The Monodromy Group of pq-Covers
نویسندگان
چکیده
In this work we study the monodromy group of covers $\varphi \circ \psi$ curves \linebreak $\mathcal{Y}\xrightarrow {\quad {\psi}} \mathcal{X} \xrightarrow \varphi} \mathbb{P}^{1}$, where $\psi$ is a $q$-fold cyclic \'etale cover and $\varphi$ totally ramified $p$-fold cover, with $p$ $q$ different prime numbers odd. We show that Galois $\mathcal{G}$ closure $\mathcal{Z}$ form $ \mathcal{G} = \mathbb{Z}_q^s \rtimes \mathcal{U}$, $0 \leq s p-1$ $\mathcal{U}$ simple transitive permutation degree $p$. Since are known, construct examples such these groups, result very from previously known case when was assumed to be cyclic, in which \mathbb{Z}_p$. Furthermore, able characterize subgroups $\mathcal{H}$ $\mathcal{N}$ $\mathcal{Y} \mathcal{Z}/\mathcal{N}$ $X \mathcal{Z}/\mathcal{H}$.
منابع مشابه
Schinzel’s Problem: Imprimitive Covers and the Monodromy Method
(1.2) the ranges of f and g are identical on almost all OK/p. The most trivial cases are where g(x) = f(ax + b) for some a, b ∈ Q̄, the algebraic numbers. When K = Q, mostly that relation forces a, b∈K. For example this holds when f is indecomposable (not a composite of lower degree polynomials). With the indecomposability assumption, solutions to Davenport’s and Schinzel’s problems were essenti...
متن کاملThe monodromy group of a truncated simplex
In this paper we investigate the monodromy groups of the truncated simplices of all possible ranks and investigate related structures. In particular, we demonstrate that the monodromy group of a truncated simplex is the direct product of symmetric groups.
متن کاملHirzebruch Surfaces: Degenerations, Related Braid Monodromy, Galois Covers
We describe various properties of Hirzebruch surfaces and related constructions: degenerations, braid monodromy, Galois covers and their Chern numbers.
متن کاملThe monodromy group of a function on a general curve
Let Cg be a general curve of genus g ≥ 4. Guralnick and others proved that the monodromy group of a cover Cg → P 1 of degree n is either Sn or An. We show that An occurs for n ≥ 2g + 1. The corresponding result for Sn is classical.
متن کاملThe Rotor-Router Group of Directed Covers of Graphs
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we study several quantities related to rotor-router walks on directed covers. The quantities under consideration are: order of the rotor-router group, order of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transformation Groups
سال: 2022
ISSN: ['1531-586X', '1083-4362']
DOI: https://doi.org/10.1007/s00031-022-09771-3